Maximum packings of Kn with k-stars
نویسندگان
چکیده
Given graphs G and H, we define an H-packing of G to be a partition of the edges of G into some copies of H along with a set of edges L, called the leave. An H-packing is called maximum when |L| is minimum, or equivalently, when the H-packing contains as many copies of H as possible. A k-star, denoted Sk, is defined to be the complete bipartite graph K1,k. In this paper we characterize the number of k-stars in a maximum Sk-packing of Kn, as well as investigate the configuration of the leave.
منابع مشابه
Maximum packings of Kn with hexagons
A complete solution of the maximum packing problem of Kn with hexagons is given.
متن کاملAlmost Resolvable Maximum Packings of Complete Graphs with 4-Cycles
If the complete graph Kn has vertex set X , a maximum packing of Kn with 4-cycles, (X,C, L), is an edge-disjoint decomposition of Kn into a collection C of 4-cycles so that the unused edges (the set L) is as small a set as possible. Maximum packings of Kn with 4-cycles were shown to exist by Schönheim and Bialostocki (Can. Math. Bull. 18:703–708, 1975). An almost parallel class of a maximum pac...
متن کاملThe Doyen-Wilson theorem for maximum packings of Kn with 4-cycles
Necessary and sufficient conditions are given to embed a maximum packing of K,, with 4-cycles into a maximum packing of K, with 4-cycles, both when the leave of the given packing is preserved, and when the leave of the given packing is not necessarily preserved.
متن کاملThe probabilistic approach to limited packings in graphs
We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for any vertex v ∈ V (G), |N [v] ∩X| ≤ k, where N [v] is the closed neighbourhood of v. The k-limited packing number Lk(G) of a graph G is the largest size of a k-limited packing in G. Limited packing problems can be considered as secure facility location problem...
متن کاملPacking and covering the complete graph with cubes
A decomposition of Kn \L, the complete graph of order n with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum packing of Kn with G if L contains as few edges as possible. A decomposition of Kn U P, the complete graph union a graph P (called the padding), into edge disjoint copies of a graph G is called a minimum covering of Kn with G if P conta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 59 شماره
صفحات -
تاریخ انتشار 2014